On Heuristic Approach for Solution of Scheduling Problem Involving Transportation Time and Break-down Times for Three Machines
نویسندگان
چکیده
منابع مشابه
Heuristic Approach Forn-jobs, 3 Machines Flow Shop Scheduling Problem Involving Transportation Time, Equivalent Job-block, Weights of Jobs and Break down Time Interval
In 1980 Miyazaki considered the weight of a job in which weight shows the relative priority over some other job in a sequencing of different jobs. After that some researchers such as Ghanshiam Das, Singh and Singhal [1981], Panwalker [1991] Sotskov, Allahverdi and Lai [2000], Chandramouli (2005) and Belwal, Mittal (2008) had considered the idea of N-job 2 machine flow shop scheduling problem wi...
متن کاملHeuristic Approach for N-job, 3-machine Flow Shop Scheduling Problem Involving Transportation Time, Break down Time and Weights of Jobs
This paper provides a new simple heuristic algorithm for a ‘3-Machine, njob’ flow-shop scheduling problem in which jobs are attached with weights to indicate their relative importance and the transportation time and break down intervals of machine are given. A heuristic approach method to find optimal or near optimal sequence minimizing the total weighted mean production flow time for the probl...
متن کاملAn Evolutionary Approach for Solving the N-Jobs M-Machines Permutation Flow-Shop Scheduling Problem with Break-Down Times
In this paper a Genetic Algorithm (GA) approach is presented to solve the N-Jobs M-Machines Permutation Flow-Shop Scheduling Problem (PFSP) with Break-down times. In comparison with other methods that start with a solution obtained with the Johnson’s Algorithm (or another greedy approach), the presented GA method starts with randomly generated solutions and within 100 iterations is able to obta...
متن کاملTwo meta-heuristic algorithms for parallel machines scheduling problem with past-sequence-dependent setup times and effects of deterioration and learning
This paper considers identical parallel machines scheduling problem with past-sequence-dependent setup times, deteriorating jobs and learning effects, in which the actual processing time of a job on each machine is given as a function of the processing times of the jobs already processed and its scheduled position on the corresponding machine. In addition, the setup time of a job on each machin...
متن کاملPareto-based Multi-criteria Evolutionary Algorithm for Parallel Machines Scheduling Problem with Sequence-dependent Setup Times
This paper addresses an unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times, which is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also, to solve the mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Research Journal of Applied Sciences, Engineering and Technology
سال: 2014
ISSN: 2040-7459,2040-7467
DOI: 10.19026/rjaset.7.573